Free Groups and Graphs: the Hanna Neumann Theorem

نویسنده

  • LAUREN COTE
چکیده

The relationship between free groups and graphs is one of the many examples of the interaction between seemingly foreign branches of mathematics. After defining and proving elementary relations between graphs and groups, this paper will present a result of Hanna Neumann on the intersection of free subgroups. Although Neumann’s orginal upper bound on the rank of the intersection has been improved upon, her conjecture, that the upper bound is half of the one she originally proved, remains an open question.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs, free groups and the Hanna Neumann conjecture

A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and in the spirit of Stallings [19]. The bound is a contribution to the strengthened Hanna Neumann conjecture.

متن کامل

Intersections and joins of free groups

Let F be a free group. If H and K are subgroups of F , we let H ∨K = 〈H,K〉 denote the join of H and K. We study the relationship between the rank of H ∩K and that of H ∨K for a pair of finitely generated subgroups H and K of F . In particular, we have the following particular case of the Hanna Neumann Conjecture, which has also been obtained by L. Louder [6] using his machinery for folding grap...

متن کامل

The Topology and Analysis of the Hanna Neumann Conjecture

The statement of the Hanna Neumann Conjecture (HNC) is purely algebraic: for a free group Γ and any nontrivial finitely generated subgroups A and B of Γ, rk (A ∩B)− 1 ≤ (rkA− 1)(rkB − 1). The goal of this paper is to systematically develop machinery that would allow for generalizations of HNC and to exhibit their relations with topology and analysis. On the topological side we define immersions...

متن کامل

A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid

Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a special class of submonoids generated by finite prefix sets. This work continues their work and provides a sufficient condition for Hanna Neumann property for ...

متن کامل

Submultiplicativity and the Hanna Neumann Conjecture

We define submultiplicativity of `-numbers in the category of Γ-complexes over a given Γ-complex X̂, which generalizes the statement of the Strengthened Hanna Neumann Conjecture (SHNC). In the case when Γ is a left-orderable group and X̂ is a free Γ-complex, we prove submultiplicativity for the subcategory consisting of Γ-ordered leafages over X̂ with an additional analytic assumption called the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008